A note on parametric spline function approximation

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

APPROXIMATION OF 3D-PARAMETRIC FUNCTIONS BY BICUBIC B-SPLINE FUNCTIONS

In this paper we propose a method to approximate a parametric 3 D-function by bicubic B-spline functions

متن کامل

A Brief Survey of Parametric Value Function Approximation A Brief Survey of Parametric Value Function Approximation

Reinforcement learning is a machine learning answer to the optimal control problem. It consists in learning an optimal control policy through interactions with the system to be controlled, the quality of this policy being quantified by the so-called value function. An important subtopic of reinforcement learning is to compute an approximation of this value function when the system is too large ...

متن کامل

A Note on Belief Structures and S-approximation Spaces

We study relations between evidence theory and S-approximation spaces. Both theories have their roots in the analysis of Dempsterchr('39')s multivalued mappings and lower and upper probabilities, and have close relations to rough sets. We show that an S-approximation space, satisfying a monotonicity condition, can induce a natural belief structure which is a fundamental block in evidence theory...

متن کامل

A note on Diophantine approximation

Given a set of nonnegative real numbers Λ= {λi}i=0, a Λ-polynomial (or Müntz polynomial) is a function of the form p(x)=ni=0 aizi (n∈N). We denote byΠ(Λ) the space of Λ-polynomials and byΠZ(Λ) := {p(x)=ni=0 aizi ∈Π(λ) : ai ∈ Z for all i≥ 0} the set of integral Λ-polynomials. Clearly, the sets ΠZ(Λ) are subgroups of infinite rank of Z[x] wheneverΛ⊂N, #Λ=∞ (by infinite rank, wemean that the real ...

متن کامل

A note on Solving Parametric Polynomial Systems

Lazard and Rouillier in [9], by introducing the concept of discriminant variety, have described a new and efficient algorithm for solving parametric polynomial systems. In this paper we modify this algorithm, and we show that with our improvements the output of our algorithm is always minimal and it does not need to compute the radical of ideals.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Computers & Mathematics with Applications

سال: 1995

ISSN: 0898-1221

DOI: 10.1016/0898-1221(95)00059-8